Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides
نویسندگان
چکیده
Level-confluence is an important property of conditional term rewriting systems that allow extra variables in the rewrite rules because it guarantees the completeness of narrowing for such systems. In this paper we present a syntactic condition ensuring level-confluence for orthogonal, not necessarily terminating, conditional term rewriting systems that have extra variables in the right-hand sides of the rewrite rules. To this end we generalize the parallel moves lemma. Our result bears practical significance since the class of systems that fall within its scope can be viewed as a computational model for functional logic programming languages with local definitions, such as let-expressions and where-constructs.
منابع مشابه
Level-Con uence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides
Level-con uence is an important property of conditional term rewriting systems that allow extra variables in the rewrite rules because it guarantees the completeness of narrowing for such systems. In this paper we present a syntactic condition ensuring level-con uence for orthogonal, not necessarily terminating, conditional term rewriting systems that have extra variables in the right-hand side...
متن کاملCertifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion
Suzuki et al. showed that properly oriented, right-stable, orthogonal, and oriented conditional term rewrite systems with extra variables in right-hand sides are confluent. We present our Isabelle/HOL formalization of this result, including two generalizations. On the one hand, we relax proper orientedness and orthogonality to extended proper orientedness and almost orthogonality modulo infeasi...
متن کاملCompleteness Results for Basic Narrowing1
In this paper we analyze completeness results for basic narrowing. We show that basic narrowing is not complete with respect to normalizable solutions for equational theories defined by confluent term rewriting systems, contrary to what has been conjectured. By imposing syntactic restrictions on the rewrite rules we recover completeness. We refute a result of Hölldobler which states the complet...
متن کاملElimination of Extra Variables in Functional Logic Programs
Programs in modern functional logic languages are rewrite systems following the constructor discipline but where confluence and termination are not required, thus defining possibly non strict and non-deterministic functions. While in practice and in some theoretical papers rewrite rules can contain extra variables in right hand sides, some other works and techniques do not consider such possibi...
متن کاملConsistency of Recursive Definitions via Shallow Confluence of Non-Orthogonal Non-Terminating Conditional Term Rewriting Systems with any kind of Extra Variables
Recursive definitions can be adequately and conveniently modeled with left-linear conditional term rewriting systems, provided that non-termination, non-trivial critical pairs, and extra variables are admitted. Confluence of such systems guarantees the object-level consistency of the underlying data types. We present a novel sufficient criterion for shallow confluence, a property which is logic...
متن کامل